Travelling salesman problem

Results: 321



#Item
291Theoretical computer science / Mathematics / Applied mathematics / Ant / Agricultural pest insects / Travelling salesman problem / Stigmergy / IDSIA / Pheromone / Ant colony optimization algorithms / Stochastic optimization / Operations research

Ant Algorithms for Discrete Optimization∗ Marco Dorigo and Gianni Di Caro

Add to Reading List

Source URL: www.idsia.ch

Language: English - Date: 2000-09-27 03:10:44
292Windows games / Computational complexity theory / NP-complete problems / Applied mathematics / Operations research / Minesweeper / Constraint satisfaction / Backtracking / Travelling salesman problem / Constraint programming / Theoretical computer science / Puzzle video games

Minesweeper as a Constraint Satisfaction Problem by Chris Studholme

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2003-02-20 13:12:00
293Operations research / Algorithm / Facility location / Linear programming relaxation / Approximation algorithm / Travelling salesman problem / Greedy algorithm / Shortest path problem / Mathematics / Theoretical computer science / Applied mathematics

SIAM J. COMPUT. Vol. 33, No. 3, pp. 544–562

Add to Reading List

Source URL: www.cse.iitd.ernet.in

Language: English - Date: 2005-08-10 05:39:50
294Operations research / Linear programming / Combinatorial optimization / Optimization problem / Mathematical optimization / Simplex algorithm / Computational complexity theory / Travelling salesman problem / Algorithm / Theoretical computer science / Mathematics / Applied mathematics

"Shortest Path problem, the Traveling Salesman problem, or the Knapsack problem, are a few of the many combinatorial optimization problems, which have very wide applications in all spheres of our lives. Unfortunately, there is a large class of problems, denoted by class NP, for

Add to Reading List

Source URL: www.iitk.ac.in

Language: English - Date: 2004-12-03 00:57:05
295NP-complete problems / Hamiltonian path / Line graph / Path / Cubic graph / Graph / Travelling salesman problem / Matching / Neighbourhood / Graph theory / Mathematics / Theoretical computer science

Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 11, no. 1, pp. 61–[removed])

Add to Reading List

Source URL: jgaa.info

Language: English - Date: 2007-05-02 06:33:52
296Theoretical computer science / Mathematical optimization / NP-complete problems / Travelling salesman problem / Genetic algorithm / Linear programming / Computational complexity theory / Global optimization / Algorithm / Operations research / Applied mathematics / Mathematics

T ECHNICAL S ESSIONS Monday, 9:00-10:20 MA-01

Add to Reading List

Source URL: www.euro2010lisbon.org

Language: English - Date: 2010-07-01 20:11:53
297NP-complete problems / Minimum spanning tree / Vertex cover / Clique problem / Travelling salesman problem / Independent set / Shortest path problem / NP-complete / Matching / Theoretical computer science / Computational complexity theory / Mathematics

Chapter 8 NP-complete problems

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2006-10-03 05:00:11
298Sanjeev Arora / Gödel Prize / Joseph S. B. Mitchell / International Colloquium on Automata /  Languages and Programming / ACM SIGACT / Travelling salesman problem / Burton Rodin / Mathematics / Kurt Gödel / Theoretical computer science / Applied mathematics / Computer science

people-sept.indd

Add to Reading List

Source URL: www.ams.org

Language: English - Date: 2010-08-12 11:02:18
299Combinatorial optimization / Travelling salesman problem / Computational complexity theory / Operations research / Lin–Kernighan heuristic / Algorithm / Optimization problem / Branch and bound / NP-complete / Theoretical computer science / Mathematics / Applied mathematics

PDF Document

Add to Reading List

Source URL: www.akira.ruc.dk

Language: English - Date: 2004-04-19 12:29:30
300Approximation algorithms / NP-complete problems / Complexity classes / Operations research / Travelling salesman problem / APX / Polynomial-time approximation scheme / Time complexity / Set TSP problem / Theoretical computer science / Computational complexity theory / Applied mathematics

PDF Document

Add to Reading List

Source URL: theory.cs.uni-bonn.de

Language: English - Date: 2013-09-09 07:23:49
UPDATE